First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time
نویسنده
چکیده
Recently, we showed that first-order model checking on nested pushdown trees can be done in doubly exponential alternating time with linear many alternations. Using the interpretation method of Compton and Henson we give a matching lower bound.
منابع مشابه
First-Order Model Checking on Generalisations of Pushdown Graphs
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsible pushdown graphs. Our main results are the following. First-order logic with reachability is uniformly decidable on nested pushdown trees. Considering first-order logic without reachability, we prove decidability i...
متن کاملA First-Order Logic on Higher-Order Nested Pushdown Trees
We introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.’s concept of nested pushdown trees. Nested pushdown trees are useful representations of control flows in the verification of programs with recursive calls of first-order functions. Higher-order nested pushdown trees are expansions of unfoldings of graphs generated by higher-order pushdown systems. Moreov...
متن کاملLanguages of Nested Trees
We study languages of nested trees—structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown programs, so that the problem of branching-time software model checking may be phrased as a membership question for such languages. We define finite-state automata accepting such languages—these automata can pass states along...
متن کاملFO Model Checking on Nested Pushdown Trees
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable μ-calculus model checking while monadic second-order logic is undecidable on this class. We show that nested pushdown trees are tree-automatic structures, whence first-ordermodel checking is decidable. Furthermore, we pro...
متن کاملN ov 2 00 8 SYMBOLIC BACKWARDS - REACHABILITY ANALYSIS FOR HIGHER - ORDER PUSHDOWN SYSTEMS
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested " stack of stacks " structure. These systems may be used to model higher-order programs and are closely related to the Caucal hierarchy of infinite graphs and safe higher-order recursion schemes. We consider the backwards-reachability problem over higher-order Alternating P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012